- algebraic specifications
- алгебричні специфікації
English-Ukrainian technical dictionary. 2015.
algebraic specifications
Смотреть что такое "algebraic specifications" в других словарях:
Algebraic specification — [cite book|title=Algebraic Specification|first=J. A.|last=Bergstra|coauthors=B. Mahr|publisher=Academic Press|date=1989|isbn=0 201 41635 2] [cite book|title=Algebraic Specification|first=E.|last=Ehrig|coauthors=J. Heering, J.… … Wikipedia
Common Algebraic Specification Language — The Common Algebraic Specification Language (CASL) is a general purpose specification language based on first order logic with induction. Partial functions and subsorting are also supported. CASL has been designed by CoFI, the Common Framework… … Wikipedia
CO-OPN — The CO OPN (Concurrent Object Oriented Petri Nets) specification language is based on both algebraic specifications and algebraic Petri nets formalisms. The former formalism represent the data structures aspects, while the latter stands for the… … Wikipedia
Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… … Wikipedia
OttoQL — is a universal QueryLanguage for tables and documents, which was implemented firstly for XML. It has a very simple syntax (kind of writing). The operations are applied generally sequentially on all corresponding tuples or subtuples. In the… … Wikipedia
ASPIK — abbr. Algebraic Specifications and Implementations ??? (ISDV) … United dictionary of abbreviations and acronyms
Communicating sequential processes — In computer science, Communicating Sequential Processes (CSP) is a formal language for describing patterns of interaction in concurrent systems.[1] It is a member of the family of mathematical theories of concurrency known as process algebras, or … Wikipedia
Domain theory — is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains. Consequently, domain theory can be considered as a branch of order theory. The field has major applications in computer science,… … Wikipedia
John V. Tucker — John Vivian Tucker (born 1952) is a British computer scientist and expert on computability theory, also known as recursion theory. His work has focussed on generalizing the classical theory to deal with all forms of discrete/digital and… … Wikipedia
Control theory — For control theory in psychology and sociology, see control theory (sociology) and Perceptual Control Theory. The concept of the feedback loop to control the dynamic behavior of the system: this is negative feedback, because the sensed value is… … Wikipedia
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
